#include"RGBTree.h"

void TestRBTree1()
{
	/*int a[] = { 10, 7, 3};*/
	/*int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };*/
	int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14,16, 3, 7, 11, 9, 26, 18, 14, 15 };
	bit::RBTree<int, int> t;
	for (auto e : a)
	{
		t.Insert(make_pair(e, e));

	
	}
	t.Inorder();
	int n = t.Height();
	cout << t.IsBalance() << endl;
	cout << n << endl;
}
	
int main()
{
	TestRBTree1();
}